The I 2 C - bus in Discrete - Time Process Algebra
نویسندگان
چکیده
Using discrete time process algebra with relative timing, a model for the I 2 C-bus is designed. The model of the I 2 C-bus is divided in three parts: a model for the bus lines, a model for the master interfaces and a model for the slave interfaces. The model of the bus lines is based on a model for a wired-AND. For the models of the interfaces, the approach is to start from a high level bus protocol and refine it step by step. First, a single master without timing constraints is considered. Then the model is adapted to deal with the timing constraints. Then also the restriction to a single master is relaxed. It turns out that the model for the slave interfaces can be based on the model for the master interfaces. The use of the model obtained is discussed and illustrated.
منابع مشابه
The I²C-Bus in Discrete-Time Process Algebra
Using discrete time process algebra with relative timing, a model for the I 2 C-bus is designed. The model of the I 2 C-bus is divided in three parts: a model for the bus lines, a model for the master interfaces and a model for the slave interfaces. The model of the bus lines is based on a model for a wired-AND. For the models of the interfaces, the approach is to start from a high level bus pr...
متن کاملIDEAL J *-ALGEBRAS
A C *-algebra A is called an ideal C * -algebra (or equally a dual algebra) if it is an ideal in its bidual A**. M.C.F. Berglund proved that subalgebras and quotients of ideal C*-algebras are also ideal C*-algebras, that a commutative C *-algebra A is an ideal C *-algebra if and only if it is isomorphicto C (Q) for some discrete space ?. We investigate ideal J*-algebras and show that the a...
متن کاملC*-algebras on r-discrete Abelian Groupoids
We study certain function algebras and their operator algebra completions on r-discrete abelian groupoids, the corresponding conditional expectations, maximal abelian subalgebras (masa) and eigen-functionals. We give a semidirect product decomposition for an abelian groupoid. This is done through a matched pair and leads to a C*-diagonal (for a special case). We use this decomposition to study ...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملDISCRETE-TIME GI/D-MSP/1/K QUEUE WITH N THRESHOLD POLICY
This paper presents a discrete-time single-server finite buffer N threshold policy queue with renewal input and discreteMarkovian service process. The server terminates service whenever the system becomes empty, and recommencesservice as soon as the number of waiting customers in the queue is N. We obtain the system-length distributionsat pre-arrival and arbitrary epochs using the supplementary...
متن کامل